Semi-orthogonal wavelet packet bases for parallel least-squares approximation
نویسندگان
چکیده
منابع مشابه
Vector Orthogonal Polynomials and Least Squares Approximation
We describe an algorithm for complex discrete least squares approximation, which turns out to be very efficient when function values are prescribed in points on the real axis or on the unit circle. In the case of polynomial approximation, this reduces to algorithms proposed by Rutishauser, Gragg, Harrod, Reichel, Ammar and others. The underlying reason for efficiency is the existence of a recur...
متن کاملParametric least squares approximation using gamma bases
We study the problem of linear approximation of a signal using the parametric Gamma bases in L2 space. These bases have a time scale parameter which has the effect of modifying the relative angle between the signal and the projection space, thereby yielding an extra degree of freedom in the approximation. Gamma bases have a simple analog implementation which is a cascade of identical lowpass fi...
متن کاملOrthogonal basis functions in discrete least squares rational approximation
We consider a problem that arises in the field of frequency domain system identification. If a discrete-time system has an input-output relation Y (z) = G(z)U(z), with transfer function G, then the problem is to find a rational approximation Ĝn for G. The data given are measurements of input and output spectra in the frequency points zk: {U(zk), Y (zk)}k=1 together with some weight. The approxi...
متن کاملShift-orthogonal wavelet bases
Shift-orthogonal wavelets are a new type of multiresolution wavelet bases that are orthogonal with respect to translation (or shifts) within one level but not with respect to dilations across scales. In this paper, we characterize these wavelets and investigate their main properties by considering two general construction methods. In the first approach, we start by specifying the analysis and s...
متن کاملLeast Squares Approximation
In many applications we want to find an approximation for a function, for example for differential equations. Example problem: We want to understand how a calculator or computer can evaluate sinx for a given value x. The processor can essentially only perform addition, multiplication, division. Therefore we can try to approximate the function with a polynomial. We use the notation Pn for polyno...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1996
ISSN: 0377-0427
DOI: 10.1016/0377-0427(96)00043-x